Kent
Differential Dynamic Causal Nets: Model Construction, Identification and Group Comparisons
You, Kang, Green, Gary, Zhang, Jian
Pathophysiolpgical modelling of brain systems from microscale to macroscale remains difficult in group comparisons partly because of the infeasibility of modelling the interactions of thousands of neurons at the scales involved. Here, to address the challenge, we present a novel approach to construct differential causal networks directly from electroencephalogram (EEG) data. The proposed network is based on conditionally coupled neuronal circuits which describe the average behaviour of interacting neuron populations that contribute to observed EEG data. In the network, each node represents a parameterised local neural system while directed edges stand for node-wise connections with transmission parameters. The network is hierarchically structured in the sense that node and edge parameters are varying in subjects but follow a mixed-effects model. A novel evolutionary optimisation algorithm for parameter inference in the proposed method is developed using a loss function derived from Chen-Fliess expansions of stochastic differential equations. The method is demonstrated by application to the fitting of coupled Jansen-Rit local models. The performance of the proposed method is evaluated on both synthetic and real EEG data. In the real EEG data analysis, we track changes in the parameters that characterise dynamic causality within brains that demonstrate epileptic activity. We show evidence of network functional disruptions, due to imbalance of excitatory-inhibitory interneurons and altered epileptic brain connectivity, before and during seizure periods.
Famous phallic tapestry may have entertained monks during meals
The 770-pound Bayeux Tapestry depicts the Norman conquest of England in 1066. Breakthroughs, discoveries, and DIY tips sent every weekday. Whether it's the morning paper, the games on the back of a cereal box, or just scrolling through social media, there is something nice about reading with a meal. For the monks living in St. Augustine's Abbey in Canterbury, England, one of the most famous (and phallic) tapestries in the world may have been their equivalent to the back of the cereal box. New research recently published in the journal claims that the 1,000-year-old Bayeux Tapestry may have served as mealtime reading.
From full bars to no service: The best and worst areas for mobile signal in the UK revealed - so, do you live in a connectivity black spot?
FBI under pressure over open airport five miles from Charlie Kirk assassination hit as private jet'vanishes' after shooting MSNBC analyst Matthew Dowd fired over'disgusting' on-air comments about Charlie Kirk shortly after conservative star was assassinated Elite sniper breaks down Charlie Kirk assassin's sick plot... and reveals tiny detail everyone's missed: The gun. MAUREEN CALLAHAN: Charlie Kirk's body wasn't even cold... before the fighting started again. Do these ghouls not see where this is headed? Charlie Kirk's powerful tribute to murdered Ukrainian refugee hours before his own assassination: 'America will never be the same' Musk dethroned as richest person by forgotten Wall Street darling's founder as stock soars 42% Charlie Kirk dead at 31: What we know so far about MAGA star's death at Utah campus that sent shockwaves around the world as FBI botches arrest and Trump promises ultimate punishment TMZ forced to apologize after staff heard erupting in laughter as Charlie Kirk's death was announced Sweater weather starts here - the cozy, chic pieces from Soft Surroundings you'll actually wear all season Trump issues Oval Office address over Charlie Kirk's assassination: 'This is a dark moment for America' Fierce debate erupts over'non-human' technology in space after video captures UFO surviving Hellfire strike Is this Charlie Kirk's killer? This Oscar-nominated actress, 68, will soon reunite with her ex in Spain for their daughter's wedding, can you guess who?
Financial Data Analysis with Robust Federated Logistic Regression
Yang, Kun, Krishnan, Nikhil, Kulkarni, Sanjeev R.
Financial data analysis plays a pivotal role in today's business landscape [1, 2, 3, 4, 5, 6, 7], including credit risk assessment (such as loan prediction and credit scoring), fraud detection, and cost optimization, etc. However, when we develop solutions to address financial problems, we will inevitably encounter a number of key challenges [1, 2, 3, 4, 5]. For example, financial data is often voluminous, dynamically and frequently generated in real time, and distributed across diverse locations, making it challenging to process and analyze in a centralized manner[1], e.g., the New Y ork Stock Exchange (NYSE) alone has billions of transactions per day. Similarly, other major exchanges, such as the Shanghai Stock Exchange (SSE) and the London Stock Exchange (LSE), also generate vast amounts of stock data. Additionally, noise and missing values unavoidably occur in financial data, which can cause results and predictions to be skewed (or even completely wrong). These challenges require firms to come up with more efficient and smarter solutions. In recent decades, machine learning has achieved remarkable success across various domains [8, 9, 10], owing to its effective generalization ability and adaptability, and has also received increasing attention in financial data analysis [11, 12], such as credit risk assessment, resource allocation, and cost optimization. However, these classical (supervised) machine learning based solutions, such as logistic regression and random forest, usually implicitly assume that 1) all the data is stored and centralized at one location, typically a single machine, and that we have full access to the entire data; 2) these algorithms expect to run on a single machine with minimal concerns for memory or disk storage limitations; and 3) the provided data is clean and free from outliers introduced by malicious adversaries, as it is stored at a single location equipped with high security protection mechanisms to prevent data corruption. Nonetheless, these assumptions do not always hold in practice.
Rolled Gaussian process models for curves on manifolds
Preston, Simon, Bharath, Karthik, Lopez-Custodio, Pablo, Kume, Alfred
Given a planar curve, imagine rolling a sphere along that curve without slipping or twisting, and by this means tracing out a curve on the sphere. It is well known that such a rolling operation induces a local isometry between the sphere and the plane so that the two curves uniquely determine each other, and moreover, the operation extends to a general class of manifolds in any dimension. We use rolling to construct an analogue of a Gaussian process on a manifold starting from a Euclidean Gaussian process. The resulting model is generative, and is amenable to statistical inference given data as curves on a manifold. We illustrate with examples on the unit sphere, symmetric positive-definite matrices, and with a robotics application involving 3D orientations.
Using LLMs for Automated Privacy Policy Analysis: Prompt Engineering, Fine-Tuning and Explainability
Chen, Yuxin, Tang, Peng, Qiu, Weidong, Li, Shujun
Privacy policies are widely used by digital services and often required for legal purposes. Many machine learning based classifiers have been developed to automate detection of different concepts in a given privacy policy, which can help facilitate other automated tasks such as producing a more reader-friendly summary and detecting legal compliance issues. Despite the successful applications of large language models (LLMs) to many NLP tasks in various domains, there is very little work studying the use of LLMs for automated privacy policy analysis, therefore, if and how LLMs can help automate privacy policy analysis remains under-explored. To fill this research gap, we conducted a comprehensive evaluation of LLM-based privacy policy concept classifiers, employing both prompt engineering and LoRA (low-rank adaptation) fine-tuning, on four state-of-the-art (SOTA) privacy policy corpora and taxonomies. Our experimental results demonstrated that combining prompt engineering and fine-tuning can make LLM-based classifiers outperform other SOTA methods, \emph{significantly} and \emph{consistently} across privacy policy corpora/taxonomies and concepts. Furthermore, we evaluated the explainability of the LLM-based classifiers using three metrics: completeness, logicality, and comprehensibility. For all three metrics, a score exceeding 91.1\% was observed in our evaluation, indicating that LLMs are not only useful to improve the classification performance, but also to enhance the explainability of detection results.
Adaptive Backdoor Attacks with Reasonable Constraints on Graph Neural Networks
Dong, Xuewen, Li, Jiachen, Li, Shujun, You, Zhichao, Qu, Qiang, Kholodov, Yaroslav, Shen, Yulong
Recent studies show that graph neural networks (GNNs) are vulnerable to backdoor attacks. Existing backdoor attacks against GNNs use fixed-pattern triggers and lack reasonable trigger constraints, overlooking individual graph characteristics and rendering insufficient evasiveness. To tackle the above issues, we propose ABARC, the first Adaptive Backdoor Attack with Reasonable Constraints, applying to both graph-level and node-level tasks in GNNs. For graph-level tasks, we propose a subgraph backdoor attack independent of the graph's topology. It dynamically selects trigger nodes for each target graph and modifies node features with constraints based on graph similarity, feature range, and feature type. For node-level tasks, our attack begins with an analysis of node features, followed by selecting and modifying trigger features, which are then constrained by node similarity, feature range, and feature type. Furthermore, an adaptive edge-pruning mechanism is designed to reduce the impact of neighbors on target nodes, ensuring a high attack success rate (ASR). Experimental results show that even with reasonable constraints for attack evasiveness, our attack achieves a high ASR while incurring a marginal clean accuracy drop (CAD). When combined with the state-of-the-art defense randomized smoothing (RS) method, our attack maintains an ASR over 94%, surpassing existing attacks by more than 7%.
CyberLLMInstruct: A New Dataset for Analysing Safety of Fine-Tuned LLMs Using Cyber Security Data
ElZemity, Adel, Arief, Budi, Li, Shujun
The integration of large language models (LLMs) into cyber security applications presents significant opportunities, such as enhancing threat analysis and malware detection, but can also introduce critical risks and safety concerns, including personal data leakage and automated generation of new malware. To address these challenges, we developed CyberLLMInstruct, a dataset of 54,928 instruction-response pairs spanning cyber security tasks such as malware analysis, phishing simulations, and zero-day vulnerabilities. The dataset was constructed through a multi-stage process. This involved sourcing data from multiple resources, filtering and structuring it into instruction-response pairs, and aligning it with real-world scenarios to enhance its applicability. Seven open-source LLMs were chosen to test the usefulness of CyberLLMInstruct: Phi 3 Mini 3.8B, Mistral 7B, Qwen 2.5 7B, Llama 3 8B, Llama 3.1 8B, Gemma 2 9B, and Llama 2 70B. In our primary example, we rigorously assess the safety of fine-tuned models using the OWASP top 10 framework, finding that fine-tuning reduces safety resilience across all tested LLMs and every adversarial attack (e.g., the security score of Llama 3.1 8B against prompt injection drops from 0.95 to 0.15). In our second example, we show that these same fine-tuned models can also achieve up to 92.50 percent accuracy on the CyberMetric benchmark. These findings highlight a trade-off between performance and safety, showing the importance of adversarial testing and further research into fine-tuning methodologies that can mitigate safety risks while still improving performance across diverse datasets and domains. All scripts required to reproduce the dataset, along with examples and relevant resources for replicating our results, will be made available upon the paper's acceptance.